An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem

The open shop scheduling problem (OSSP) is one of the standard problems. It consists jobs associated with a finite set tasks developed by different machines. In this case, each machine processes at most operation time, and job processing order on machines does not matter. goal to determine completion times operations processed minimize largest called Cmax. This paper proves that OSSP has path algebra Brauer configuration whose representation theory (particularly its dimension center) can be given using corresponding value. also been proved centers algebras OSSPs minimal are congruent modulo number